Strong Skolemization
نویسنده
چکیده
Skolemization is a means to eliminate existential quantiiers within predicate logic sentences by replacing existentially quantiied variables with Skolem function applications. The arguments of such Skolem functions are variables that are quantiied outside the sub-formula under consideration. In this article a skolemization technique is introduced which abstracts from some of the Skolem function arguments. It turns out that the result obtained this way is usually more general than what can be achieved from standard (classical) Skolemization techniques. From a theorem prover's point of view such generalizations often lead to a reduction of both search space and proof length.
منابع مشابه
On Skolemization in constructive theories
In this paper a method for the replacement, in formulas, of strong quantifiers by functions is introduced that can be considered as an alternative to Skolemization in the setting of constructive theories. A constructive extension of intuitionistic predicate logic that captures the notions of preorder and existence is introduced and the method, orderization, is shown to be sound and complete wit...
متن کاملDomain Recursion for Lifted Inference with Existential Quantifiers
In recent work, we proved that the domain recursion inference rule makes domain-lifted inference possible on several relational probability models (RPMs) for which the best known time complexity used to be exponential. We also identified two classes of RPMs for which inference becomes domain lifted when using domain recursion. These two classes subsume the largest lifted classes that were previ...
متن کاملSemantical Investigation of Simultaneous Skolemization for First-order Sequent Calculus Semantical Investigation of Simultaneous Skolemization for First-order Sequent Calculus
Simultaneous quantiier elimination in sequent calculus is an improvement over the well-known skolemization. It allows a lazy handling of instantiations as well as of the order of certain reductions. We prove the soundness of a sequent calculus which incorporates a rule for simultaneous quantiier elimination. The proof is performed by semantical arguments and provides some insights into the depe...
متن کاملGlobal Skolemization with grouped quantifiers (Abstract)
Elimination of quantifiers from formulae of classical first-order logic is a process with many implications in automated deduction [6, 1] and in foundational issues [4, 7]. When no particular theory is considered, quantifiers are usually eliminated by adopting Skolemization or the ε-operator. Traditionally, Skolemization and the ε-symbol have different, if not complementary, employments. Skolem...
متن کاملSkolemization for Weighted First-Order Model Counting
First-order model counting emerged recently as a novel reasoning task, at the core of efficient algorithms for probabilistic logics. We present a Skolemization algorithm for model counting problems that eliminates existential quantifiers from a first-order logic theory without changing its weighted model count. For certain subsets of first-order logic, lifted model counters were shown to run in...
متن کامل